//LittlePig
#include<bits/stdc++.h>
using namespace std;
int n;
int a[111111];
int top=1;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    for(int i=2;i<=n;i++)
    {
        if(a[i]>a[top])top++;
    }
    printf("%d\n",n-top+1);
    return 0;
}
